Relaxed averaged alternating reflections for diffraction imaging
نویسندگان
چکیده
منابع مشابه
Relaxed Averaged Alternating Reflections for Diffraction Imaging
We report on progress in algorithms for iterative phase retrieval. The theory of convex optimisation is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval. We propose a relaxation of averaged alternating reflectors and determine the fixed point set of the related operator in the convex case. A numerical study supports our theoretical observations ...
متن کاملRelaxed Averaged Successive Reflectors for Image Recovery
We report on progress in algorithms for iterative phase retrieval. The theory of convex optimization is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval. We propose a relaxation of averaged successive reflectors and determine the fixed point set of the related operator in the convex case. A numerical study supports our theoretical observations a...
متن کاملRelaxed Alternating Projection Methods
In this paper we deal with the von Neumann alternating projection method xk+1 = PAPBxk and with its generalization of the form xk+1 = PA(xk + k(PAPBxk xk)), where A;B are closed and convex subsets of a Hilbert space H and FixPAPB 6= ?. We do not suppose that A \ B 6= ?. We give su¢ cient conditions for the weak convergence of the sequence (xk) to FixPAPB in the general case and in the case A is...
متن کاملLocal Linear Convergence for Alternating and Averaged Nonconvex Projections
The idea of a finite collection of closed sets having “linearly regular intersection” at a point is crucial in variational analysis. This central theoretical condition also has striking algorithmic consequences: in the case of two sets, one of which satisfies a further regularity condition (convexity or smoothness for example), we prove that von Neumann’s method of “alternating projections” con...
متن کاملLocal convergence for alternating and averaged nonconvex projections
The idea of a finite collection of closed sets having “strongly regular intersection” at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically, we consider the case of two sets, one of which we assume to be suitably “regular” (special cases being convex sets, smooth manifolds, or feasible regions sat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2004
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/21/1/004